Saddle point optimality criteria and duality for convex continuous-time programming problem

In this paper, convex continuous-time programming problem with inequality type of constraints is considered. We derive new saddle point optimality conditions and classical duality results such as weak strong properties, under additional regularity assumption. A fundamental tool, employed in the derivation necessary criteria result for programming, a version theorem alternative infinite-dimensional spaces.